Isotopic Fréchet Distance
نویسندگان
چکیده
We present a variant of the Fréchet distance (as well as geodesic and homotopic Fréchet distance) which forces the motion between the input objects to follow an ambient isotopy. This provides a measure of how much you need to continuously deform one shape into another while maintaining topologically equivalently shapes throughout the deformation.
منابع مشابه
Go with the Flow: The Direction-Based Fréchet Distance of Polygonal Curves
We introduce a new distance measure for directed curves in R, called the direction-based Fréchet distance. Like the standard Fréchet distance, this measure optimizes over all parameterizations for a pair of curves. Unlike the Fréchet distance, it is based on differences between the directions of movement along the curves, rather than on positional differences. Hence, the direction-based Fréchet...
متن کاملPartial Matching between Surfaces Using Fréchet Distance
Computing the Fréchet distance for surfaces is a surprisingly hard problem. It has been shown that it is NP-hard to compute the Fréchet distance between many nice classes of surfaces [God98], [Buc10]. On the other hand, a polynomial time algorithm exists for computing the Fréchet distance between simple polygons [Buc06]. This was the first paper to give an algorithm for computing the Fréchet di...
متن کاملLocally Correct Fréchet Matchings
The Fréchet distance is a metric to compare two curves, which is based on monotonous matchings between these curves. We call a matching that results in the Fréchet distance a Fréchet matching. There are often many different Fréchet matchings and not all of these capture the similarity between the curves well. We propose to restrict the set of Fréchet matchings to “natural” matchings and to this...
متن کاملComputing Discrete Fréchet Distance
The Fréchet distance between two curves in a metric space is a measure of the similarity between the curves. We present a discrete variation of this measure. It provides good approximations of the continuous measure and can be efficiently computed using a simple algorithm. We also consider variants of discrete Fréchet distance, and find an interesting connection to measuring distance between th...
متن کاملFréchet Distance Problems in Weighted Regions
We discuss two versions of the Fréchet distance problem in weighted planar subdivisions. In the first one, the distance between two points is the weighted length of the line segment joining the points. In the second one, the distance between two points is the length of the shortest path between the points. In both cases, we give algorithms for finding a (1 + ǫ)-factor approximation of the Fréch...
متن کامل